Systems and methods for gnss snr probabilistic localization and 3-d mapping

ABSTRACT

Various embodiments each include at least one of systems, methods, devices, and software for GNSS simultaneous localization and mapping (SLAM). The disclosed techniques demonstrate that simultaneous localization and mapping (SLAM) can be performed using only GNSS SNR and geo-location data, collectively termed GNSS data henceforth. A principled Bayesian approach for doing so is disclosed. A 3-D environment map is decomposed into a grid of binary-state cells (occupancy grid) and the receiver locations are approximated by sets of particles. Using a large number of sparsely sampled GNSS SNR measurements and receiver/satellite coordinates (all available from off-the-shelf GNSS receivers), likelihoods of blockage are associated with every receiver-to-satellite beam. Loopy Belief Propagation is used to estimate the probabilities of each cell being occupied or empty, along with the probability of the particles for each receiver location.

RELATED APPLICATION AND PRIORITY CLAIM

This application is a continuation of U.S. application Ser. No. 15/038,702, filed on May 23, 2016, which is a U.S. National Stage Filing under 35 U.S.C. 371 from International Application No. PCT/US2014/068220, filed on Dec. 2, 2014, and published as WO 2015/126499 A2 on Aug. 27, 2015, which is related and claims priority to U.S. Provisional Application No. 61/910,866, filed on Dec. 2, 2013 and entitled “PROBABILISTIC LOCALIZATION AND 3-D MAPPING BASED ON GNSS SNR MEASUREMENTS,” the entirety of each of which is incorporated herein by reference.

STATEMENT OF GOVERNMENT SPONSORED SUPPORT

The subject matter here was developed with Government support under Grant (or Contract) No. W911NF-09-D-0001 awarded by the U.S. Army Research Office. The Government has certain rights to the subject matter herein.

BACKGROUND INFORMATION

Global Navigation Satellite Systems (GNSS), such as GPS, are often used for geo-localization and navigation. These GNSS systems (e.g., Galileo, GLONASS, Beidou) consist of constellations of satellites in space, with each satellite wirelessly broadcasting signals containing information so that corresponding earth-based receivers can determine their geo-location. The use of GNSS has become ubiquitous with the advent of consumer mobile electronic devices. Several satellite systems have been deployed in recent years, resulting in multiple GNSS satellite constellations. As more GNSS receivers become capable of interacting with each of these satellite systems, the application of the systems and methods proposed herein will only be enhanced. However, GNSS localization quality is often degraded. This degradation is especially prevalent in urban areas, including signal blockage and multi-path reflections from buildings, trees, terrain, and other obstacles.

The disclosed techniques demonstrate that simultaneous localization and mapping (SLAM) can be performed using only GNSS SNR and geo-location data, collectively termed GNSS data henceforth. A principled Bayesian approach for doing so is disclosed, but alternative approaches at varying degrees of complexity and accuracy may be employed by one skilled in the art.

In GNSS and other wireless communication, line-of-sight (LOS) channels are characterized by statistically higher received power levels than those in which the LOS signal component is blocked (e.g., non-LOS or NLOS channels). As a mobile GNSS receiver traverses an area, obstacles (e.g., buildings, trees, terrain) frequently block the LOS component of different satellite signals, resulting in NLOS channels characterized by statistically lower signal-to-noise ratios (SNR). Many GNSS receivers can also log the transmitted or computed geo-location data, including per-satellite azimuth/elevation, SNR, and the latitude/longitude of the receiver.

In addition to GNSS localization, three-dimensional (e.g., 3-D) maps of urban environments are of tremendous importance for several types of commercial applications. However, existing methods for 3-D mapping of city environments are expensive or necessitate significant planning and surveying, such as using LiDAR surveying or aerial photography surveying.

Due to growing demand for accurate geo-location services and the fact that GNSS positioning accuracy degrades in cluttered urban environments, existing mapping solutions have focused on refining position estimates by using known 3-D environment maps. In some embodiments, “shadow matching” (SM) may improve localization. Essentially, SM involves detecting occluded signals and matching the corresponding points of reception to areas inside the “shadows” of the signal-blocking buildings, thereby constraining the space of possible receiver locations. SM may be implicitly performed by first learning and then matching against SNR measurement models, where the models may vary as a function of the receiver coordinates, and where the LOS/NLOS channel conditions are modeled probabilistically.

Using GNSS signal strength to construct 3-D environment maps is a relatively new area of research. Generally, GNSS-derived information is used to identify shadows of buildings with respect to different satellite configurations (as in SM), after which ray-tracing methods may be used to build environment maps. However, existing methods rely on a collection of heuristics resulting in “hard” maps, with no notion of map uncertainty and no straightforward way to update the map in a principled, consistent manner when additional measurements become available.

Due to the complexity of mapping problems, some existing solutions rely on probabilistic techniques to estimate maps. For applications focusing on the mapping of urban landscapes, some form of obstacle detection is typically used. This may use sensors, such as LiDAR mounted on the sensing vehicle, that take obstacle-range readings in chosen directions but with respect to a local reference frame. Without correction, such active mapping techniques can be plagued by self-localization errors (e.g., position/velocity errors, orientation errors), leading to a data association problem. As a result, some approaches employ a class of algorithms known as simultaneous localization and mapping (SLAM) to estimate the map and localize the sensing vehicle jointly. What is needed in the art is a localization approach that reduces the effects of localization errors.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 shows an example probabilistic localization and 3-D mapping system, according to an example embodiment.

FIG. 2 shows a block diagram of urban GNSS signal degradation, according to an example embodiment.

FIG. 3 shows a SNR measurement scenario with occupancy grid illustration, according to an example embodiment.

FIG. 4 shows a generalized GNSS belief propagation (BP) method 400, according to an example embodiment.

FIG. 5 is a plot of probability density as a function of satellite power distributions, according to an example embodiment.

FIG. 6 shows an example simplified mapping cubic lattice, according to an example embodiment.

FIG. 7 is a block diagram of a GNSS BP mapping method, according to an example embodiment.

FIG. 8 shows a map posterior distribution factor graph, according to an example embodiment.

FIG. 9 show synchronous BP messages passing, according to an example embodiment.

FIG. 10 shows an example aerial view of a building, according to an example embodiment.

FIG. 11 shows an example mapping result, according to an example embodiment.

FIG. 12 shows measurement data increase comparison, according to an example embodiment.

FIG. 13 shows a horizontal slice height comparison, according to an example embodiment.

FIG. 14 is a block diagram of a GNSS BP mapping or positioning method, according to an example embodiment.

FIG. 15 shows a simultaneous localization and mapping (SLAM) factor graph, according to an example embodiment.

FIGS. 16A and 16B show synchronous SLAM BP messages passing, according to an example embodiment.

FIG. 17 shows an example mapping result comparison, according to an example embodiment.

FIG. 18 shows a horizontal slice height, according to an example embodiment.

FIG. 19 shows GPS receiver position fixes and uncertainty ellipses, according to an example embodiment.

FIG. 20 is a block diagram of a GNSS BP mapping or positioning method, according to an example embodiment.

FIG. 21 shows a motion factor graph, according to an embodiment, according to an example embodiment.

FIG. 22 is a block diagram of a GNSS BP mapping or positioning method, according to an example embodiment.

FIG. 23 is a block diagram of a GNSS particle filter SLAM method, according to an embodiment, according to an example embodiment.

FIG. 24 is a block diagram of a map update method, according to an embodiment, according to an example embodiment.

FIG. 25 is a block diagram of a GNSS map matching method, according to an embodiment, according to an example embodiment.

FIG. 26 is a block diagram of a computing device, according to an example embodiment.

DETAILED DESCRIPTION

In the following detailed description of systems and methods for GNSS SNR probabilistic localization and 3-D mapping, reference is made to the accompanying drawings that form a part hereof, and in which is shown by way of illustration specific embodiments in which the inventive subject matter may be practiced. These embodiments are described in sufficient detail to enable those skilled in the art to practice them, and it is to be understood that other embodiments may be used and that structural, logical, and electrical changes may be made without departing from the scope of the inventive subject matter. Such embodiments of the inventive subject matter may be referred to, individually and/or collectively, herein by the term “invention” or “subject matter” merely for convenience and without intending to limit the scope of this application voluntarily to any single invention or inventive concept if more than one is in fact disclosed. The following description is, therefore, not to be taken in a limited sense, and the scope of the inventive subject matter is defined by the appended claims.

Using only GNSS SNR and geo-location data, a coarse 3-D map of an unknown region may be estimated in a principled Bayesian manner. The present subject matter includes two primary elements. First, using a physically inspired sensor model, GNSS signal “rays” from various receiver positions to different satellites can be assigned likelihoods of being LOS/NLOS. Second, these rays can be stitched together via Belief Propagation to form a probabilistic map.

To highlight the efficiency of this system and method, the following detailed description describes how the computational complexity scales linearly in the number of measurements and size of the unknown region. This linear scaling enables this to be used in online and offline mapping scenarios. For real-time processing, the incremental complexity of map updates is reduced.

The functions or algorithms described herein may be implemented in hardware, software, or a combination of software and hardware. The software comprises computer executable instructions stored on computer readable media such as memory or other type of storage devices. Further, described functions may correspond to modules, which may be software, hardware, firmware, or any combination thereof. Multiple functions are performed in one or more modules as desired, and the embodiments described are merely examples. The software is executed on a digital signal processor, ASIC, microprocessor, or other type of processor operating on a system, such as a personal computer, a mobile device, server, a router, or other device capable of processing data including network interconnection devices. Some embodiments implement the functions in two or more specific interconnected hardware modules or devices with related control and data signals communicated between and through the modules, or as portions of an application-specific integrated circuit. Thus, the exemplary process flow is applicable to software, firmware, and hardware implementations.

FIG. 1 shows an example probabilistic localization and 3-D mapping system 100, according to an embodiment. System 100 may include multiple GNSS data devices 105. GNSS data devices 105 may include any mobile devices capable of providing GNSS data, including tablets, smart phones, smart watches, vehicular navigation systems, and other devices. GNSS data devices 105 may provide GNSS data 110 to a probabilistic localization and 3-D mapping server 115. GNSS data 110 may include information logged by GNSS receivers. This information includes T receiver position fixes x={x_(t)}^(T)t=1, where x_(t) is the reported latitude and longitude at time t. In addition the receiver reports satellite SNR measurements, which consist of T vectors, z={z_(t)}^(T) _(t=1), where z_(t)=[z_(t,1), . . . , z_(t,N) _(t) ] contains individual SNR readings and N_(t) is the number of satellites in view at measurement index t. Together with individual SNR readings, the receivers may provide satellite identifiers or satellite elevations and azimuths [θ_(t,n), φ_(t,n)], which we consider noiseless. Alternatively, the satellite identifiers, satellite elevations, and satellite azimuths may be received from an external source, such as from JPL or another source. Throughout this document, because various equations may be directed to probabilistic variables, the equations may not include noiseless satellite identifiers, satellite elevations, satellite azimuths, or other noiseless (e.g., non-probabilistic) information.

GNSS data devices 105 may provide GNSS data 110 to a probabilistic localization and 3-D mapping server 115, which may include a 3-D mapping module 120 and a real-time positioning module 125. Server 115 may reside on a smartphone, on an internet-based (e.g. cloud-based) server, on a desktop computer, or on any other mobile or stationary computing device. Server 115 may provide a corrected position 130 to a user device 135, where the corrected position 130 may be calculated using either or both of the 3-D mapping module 120 and real-time positioning module 125. For example, the user device 135 may provide GNSS data 140 to the server 115, the server may use the provided GNSS data within the 3-D mapping module 120 to update a 3-D map, and the server may generate an updated corrected position 130 using the real-time positioning module 125.

The 3-D maps generated by this mapping system 100 may be used to increase the accuracy of GNSS (e.g., GPS) location estimation of mobile devices. Such a mapping system 100 may be used to improve localization of mobile devices as part of the mobile OS or mobile apps that provide 3-D maps. Such a mapping system 100 may be used to generate 3-D maps for use in simulation and prediction of wireless coverage by wireless telecommunication operators. The 3-D maps may also be used as input for simulation environments for flight simulators, 3-D video games, military mission planning, or other mapping and localization applications.

FIG. 2 shows a block diagram of urban GNSS signal degradation 200, according to an embodiment. GNSS localization quality is often degraded due to signal blockage and multi-path reflections. As shown in FIG. 2, a mobile device 205 may be located in an urban environment, where the urban environment may include two nearby buildings 210 and 215. Satellite 220 may be on the opposite side of building 210 from the mobile device 205, and building 210 may block the signal 225 from GNSS satellite 220. Satellite 230 may have a direct line-of-sight (LOS) to the mobile device 205, where the direct LOS allows satellite 230 to transmit a direct LOS GNSS signal 235 with a high signal-to-noise ratio (SNR). Satellite 240 may be positioned such that building 215 blocks a LOS GNSS signal from satellite 240. Satellite 240 may be positioned such that building 210 reflects the GNSS signal and results in a non-line-of-sight (NLOS) GNSS signal path 245 (e.g., multipath reflection) to the mobile device 205. Because the building 210 is an imperfect signal reflector, and because the length of the NLOS GNSS signal path 245 (e.g., pseudo range measurement) can be significantly longer than the LOS path (true range), the received multipath NLOS GNSS signal is usually lower in power and results in a large localization uncertainty. When several GNSS signals are blocked by buildings, the remaining unblocked GNSS satellites are typically in a poor geometry for localization. This may result in a noisy horizontal position fix 235 (e.g., high horizontal dilution of precision). An NLOS can be characterized by a statistically lower SNR than a LOS signal. By observing SNR measurements, the existence of NLOS/LOS channels and nearby obstacles can be inferred in various directions relative to the satellite locations and geo-location of the mobile device 205. For example, using a large set of GNSS SNR measurements and receiver and satellite coordinates, likelihoods of blockage are associated with every receiver-to-satellite ray. The GNSS SNR data may come from any of various sources, including crowd-sourced data from multiple GNSS receivers or from a single GNSS receiver. By fusing information from multiple receiver locations and multiple satellites, it becomes possible to determine the geo-location of obstacles, such as shown and described with respect to FIG. 3.

FIG. 3 shows a SNR measurement scenario with occupancy grid illustration 300, according to an embodiment. To make the problem tractable, the region of interest is partitioned into a 3-D arrangement of cells (e.g., volumetric pixels, voxels), and the mapping problem is formulated as computing the occupancy probabilities of each cell in the occupancy grid. This quantizes the measurement rays to cells along the 3-D grid, as illustrated in FIG. 3. As shown in FIG. 3, SNR measurement rays are shown as signal paths to various satellites. LOS rays may trace through multiple cells that represent empty space, such as rays 310, 320, and 330. NLOS rays may trace through multiple cells that represent empty space and cells that represent occupied space, such as rays 340, 350, and 350. The NLOS rays may correspond to signals that are characterized by statistically lower SNR values.

After defining the GNSS-SNR measurement model, a sparse graphical model describing the dependencies between the occupancy grid and SNR measurements is constructed. This model is then used to represent the posterior probability distribution of the map and receiver locations within a factor graph. Loopy Belief Propagation (LBP) may be applied to the factor graph to estimate efficiently the probabilities of each cell being occupied or empty, and to estimate the probability of hypothesized receiver locations. By using the factor graph with Loopy Belief Propagation approach, the present subject matter can compute the full map posterior and geo-location estimates in one batch operation. Application of the Loopy Belief Propagation algorithm to provide estimated probabilities of cell occupancy is described below with respect to FIG. 4.

FIG. 4 shows a generalized GNSS belief propagation (BP) method 400, according to an embodiment. Method 400 may begin with receiving 410 input GNSS data. Receiving 410 input GNSS data may include receiving an estimated user position, such as a latitude and longitude. Receiving the estimated user position may include receiving an estimated user position calculated by an external GNSS device, or may include receiving raw GNSS information and calculating an estimated user position. The estimated user position may include a combination of location information, such as provided by GNSS location information, Wi-Fi positioning, cellular data triangulation, or other location information. Receiving 410 input GNSS data may include may also include receiving satellite coordinates or receiving observed SNR measurements. Receiving predicted satellite locations may include receiving calculated satellite locations, or may include receiving raw satellite location information (e.g., almanac, ephemeris) and calculating an estimated user position.

Method 400 may include constructing 420 a Bayesian network factor graph. The network factor graph may include multiple SNR measurement factor nodes and multiple voxel occupation probability nodes, as shown and described below with respect to FIGS. 8, 15, and 21. Constructing 420 the Bayesian network factor graph may include ray-tracing 424 multiple rays through multiple voxels within a volumetric map. Each of the rays may represent a GNSS satellite ray from a GNSS receiver position to each of multiple GNSS satellites. Constructing 420 the Bayesian network factor graph may also include storing multiple occupancy probabilities associated with each of the voxels within the volumetric map, each of the occupancy probabilities indicating a likelihood that each of the voxels is occupied by an obstruction. Constructing 420 the Bayesian network factor graph may also include assigning (e.g., associating) 426 a line-of-sight/non-line-of-sight (LOS/NLOS) probability with each of the rays.

Method 400 may include running 430 belief propagation (BP). Running 430 belief propagation may include passing 432 messages between Bayesian network factor graph nodes. The Bayesian network factor graph nodes may include multiple map state variable nodes and multiple SNR likelihood factor nodes, and running 430 belief propagation may include passing 432 messages between the map state variable nodes and the SNR likelihood factor nodes. Passing 432 messages may be conducted according to a message passing schedule, where the schedule may be synchronous or asynchronous. Method 400 may include outputting 440 a 3-D occupancy map, a time sequence of position, or both.

Elements within method 400 may be executed on a mobile device (e.g., handheld computer, tablet, smartphone, smartwatch), or may be executed on a stationary device (e.g., desktop computer, server), such as the device shown and described below with respect to FIG. 26. The generalized GNSS belief propagation (BP) method 400 may be modified to include various additional method steps, such as shown and described below with respect to FIG. 7, 14, 20, or 22. For example, additional method steps may include using map prior information to initialize (e.g., seed or hot start) the map. Additional method steps may include updating or rerunning with additional data, which may extend method 400 to both batch operation and repeating (e.g., continuous) data processing. Similarly, for BP-based methods, additional method steps may include rebuilding graph and rerunning BP 430, or resampling position particle sets around output estimates and rebuilding 420 the factor graph and rerunning BP 430.

Receiving 410 input GNSS data may vary according to implementation. For example, receiving 410 input GNSS data may include receiving position input and uncertainty, where these inputs may be an output of a GNSS device or a fused output, such as a combination of Wi-Fi and GPS locations. Additional method steps may include adjusting map resolution, such as for non-uniform voxel sizes. Similarly, additional method steps may include dynamic voxel size adjustment.

FIG. 5 is a plot of probability density as a function of satellite power distributions 500, according to an embodiment. As depicted in FIG. 5, the received power of an LOS satellite may be modeled using a Rician fading distribution 510. This Rician fading distribution 510 models the LOS satellite power as a superposition of a dominant LOS component and a circular Gaussian component. Similarly, the received power of an NLOS satellite may be modeled using a Log-Normal fading distribution 520. This Log-Normal fading distribution 520 models the NLOS satellite power as predominantly characterized by variations due to random, multiplicative shadow fading. After a change of variables to define the Rice density on the decibel scale, the following probability density function (pdf) is obtained:

${f_{LOS}\left( z_{t,n} \middle| d \right)} = {\frac{\ln \; 10}{20}\frac{10^{z_{t,n}/10}}{s^{2}}{\exp\left( {- \frac{10^{z_{t,n}/10} + v^{2}}{2s^{2}}} \right)}{I_{0}\left( \frac{10^{z_{t,n}/20}v}{s^{2}} \right)}}$

where

${v^{2} = {\frac{K}{1 + K}{\hat{\Omega}}_{t,n}}},{s^{2} = \frac{{\hat{\Omega}}_{t,n}}{2\left( {1 + K} \right)}},{I_{0}( \cdot )}$

is the 0th order modified Bessel function of the first kind, and Q_(t,n) and K are the total estimated channel power and the Rician “K factor” (ratio of LOS to diffuse power), respectively. As for the NLOS hypothesis, in decibels the Log-Normal fading model for NLOS channels is described by a normal distribution:

${f_{NLOS}\left( z_{t,n} \middle| d \right)} = {\frac{1}{\sqrt{2\pi \; \sigma^{2}}}{\exp\left( {- \frac{\left( {z_{t,n} - \mu_{t,n}} \right)^{2}}{2\sigma^{2}}} \right)}}$

where μ_(t,u) is the mean fading value and σ is the standard deviation.

While the system and method described herein characterizes LOS satellite power using a Rician fading distribution 510 and characterizes NLOS satellite power using a Log-Normal fading distribution 520, other distributions may be applied, and various distributions may be applied in combination. For example, satellite elevation may be used to augment the distribution. In particular, lower elevation satellites are more likely to be blocked or subject to multipath errors, and their distribution may be updated to include a wider distribution or longer distribution tails. In an example, the satellite elevation may be used to predict an expected overhead satellite constellation, and a lack of receipt of expected satellite measurements may be used to identify NLOS rays. Satellite elevations may be calculated based on ephemerides, where the ephemerides may be available via a network from JPL or another source.

FIG. 6 shows an example simplified mapping cubic lattice 600, according to an embodiment. This cubic lattice construction is motivated at least in part by the spatial correlation of real-world map. FIG. 6 depicts four satellite rays 610, 615, 620, and 625. Rays 610, 615, 620, and 625 trace a path from two satellites 630 and 635 through one or more of six lattice cubes 640, 645, 650, 655, 660, and 665. Lattice cubes 640, 645, 650, and 660 may represent open space, and lattice cubes 655 and 665 may represent occupied space. In this example, satellite 630 may be overhead, and both LOS rays 610 and 615 may trace from satellite 630 through open lattice cubes 640, 650, and 660. Satellite 635 may not be overhead, and LOS ray 620 may trace from satellite 635 through open lattice cubes 645, 640, 650, and 660. In contrast to LOS rays 610, 615, and 620 tracing through open lattice cubes, NLOS ray 625 may trace from satellite 635 through open lattice cube 645, though occupied lattice cubes 650 and 660, and then through open lattice cube 660.

As suggested by FIG. 6, an SNR reading may be associated with the LOS channel distribution if all cells intersected by its associated ray are empty, otherwise it may be associated with the NLOS channel distribution. Assuming conditional independence of the measurements and ignoring localization errors in x_(t), the posterior distribution of the map cells given the SNR-measurements and geo-location data is, by applying Bayes Theorem,

$\begin{matrix} {{p\left( {\left. m \middle| x \right.,z} \right)} = {\frac{{p(m)}{p\left( {\left. z \middle| m \right.,x} \right)}}{p(z)} \propto {{p(m)}{\prod\limits_{t,n}\; {p\left( {\left. z_{t,n} \middle| x_{t} \right.,m} \right)}}}}} & (1) \end{matrix}$

where p(m) is the prior probability distribution of the map, i.e., contains a-priori information on the map occupancy.

Generally, the SNR measurement model for a given GNSS signal may depend on a multitude of phenomena, including, but not limited to: radio frequency (RF) propagation effects (multipath, diffraction); environmental parameters (building penetration, building material, weather); and receiver characteristics (antenna patterns, RF/baseband filtering). While effective parametric statistical models exist for the narrowband Land to Mobile Satellite (LMS) channels of interest, to avoid over-modeling and greatly simplify the BP-based inference step, the forward measurement model may be defined as follows. Conditioned on the map m and positions x_(t), each SNR measurement z_(t,n) may be modeled as an independent random variable defined by one of two probability density functions:

$\begin{matrix} {{p\left( {\left. z_{t,n} \middle| x_{t} \right.,m} \right)} = \left\{ \begin{matrix} {{f_{LOS}\left( z_{t,n} \right)},} & {m_{i} = {0{\forall{i \in {\left( {t,n} \right)}}}}} \\ {f_{NLOS}\left( z_{t,n} \right)} & {otherwise} \end{matrix} \right.} & (2) \end{matrix}$

where M(t,n) denotes the indices of the cells intersected by the ray starting at receiver position x_(t), in the direction of satellite n at time t. As suggested above, (2) shows that SNR reading comes from the LOS channel distribution if all cells intersected by its associated ray are empty; otherwise, it comes from the NLOS channel distribution.

FIG. 7 is a block diagram of a GNSS BP mapping method 700, according to an embodiment. In one embodiment, method 700 may assume a motion model. Method 700 may include receiving 710 input GNSS data. Input GNSS data may include receiving multiple predicted satellite coordinates, receiving multiple measured signal-to-noise ratio (SNR) values, or receiving multiple estimated receiver locations. Input GNSS data may also include multiple prior map occupancy probabilities or multiple GNSS receiver uncertainty values. Receiving 710 input GNSS data may also include receiving 712 an SNR measurement model. The SNR measurement model may describe an expected relationship between multiple SNR measurements and multiple LOS/NLOS likelihoods.

Method 700 may include constructing 720 a Bayesian network factor graph, the Bayesian network factor graph including multiple factor graph nodes. Constructing 720 the Bayesian network factor graph may include sampling 722 multiple particles for multiple GNSS receiver positions. Constructing 720 the Bayesian network factor graph may include ray-tracing 724 multiple rays through multiple voxels within a volumetric map. Each of the rays may represent a GNSS satellite ray from a GNSS receiver position to each of multiple GNSS satellites. Constructing 720 the Bayesian network factor graph may also include storing multiple occupancy probabilities associated with each of the voxels within the volumetric map, each of the occupancy probabilities indicating a likelihood that each of the voxels is occupied by an obstruction. Constructing 720 the Bayesian network factor graph may also include assigning (e.g., associating) 726 a line-of-sight/non-line-of-sight (LOS/NLOS) probability with each of the rays.

Method 700 may include running 730 belief propagation to determine mapping estimates for multiple 3-D locations within a 3-D occupancy map. Running 730 belief propagation may include passing 732 messages between Bayesian network factor graph nodes. The Bayesian network factor graph nodes may include multiple map state variable nodes and multiple SNR likelihood factor nodes, and running 730 belief propagation may include passing 732 messages between the map state variable nodes and the SNR likelihood factor nodes. Passing 732 messages may be conducted according to a message passing schedule, where the schedule may be synchronous or asynchronous. Running 730 belief propagation may include holding position estimates constant. Running 730 belief propagation may be repeated until convergence on an output within a selected threshold, or may continue for a selected determining duration. The convergence of LBP may be declared when the mean of all variables' belief residuals falls below a predefined threshold Rth. To limit oscillations and help ensure that LBP converges, we may apply message damping with damping factor ρϵ[0; 1). The belief residuals of m_(i) may be defined via the L₁ norm:

${R_{i}\overset{\Delta}{=}{\sum\limits_{m_{i} = 0}^{1}{{{b_{i}\left( m_{i} \right)} - {b_{i}^{\prime}\left( m_{i} \right)}}}}},{R_{t}\overset{\Delta}{=}{\sum\limits_{k = 1}^{K}{{{b_{i}\left( x_{t}^{k} \right)} - {b_{i}^{\prime}\left( x_{t}^{k} \right)}}}}}$

where b_(i)′ are the beliefs from the previous iteration. While the belief residuals are defined here via the L₁ norm, other belief residuals may be used. Upon converging, or after one or more iterations without converging, running 730 belief propagation may update 734 3-D occupancy probabilities.

Method 700 may include applying 740 Bayesian shadow matching to determine a sequence of improved position estimates. Applying 740 Bayesian shadow matching may include applying 742 a particle filter while holding position estimates constant. Method 700 may include outputting 750 a navigation output. The navigation output may include a 3-D occupancy map including the 3-D occupancy probabilities.

FIG. 8 shows a map posterior distribution factor graph 800, according to an embodiment. Factor graph 800 depicts the relationship between the LOS/NLOS channel model, the map prior distribution, and the map posterior distribution. Factor graph 800 is a bipartite graph with “map cell” variable nodes m_(i) 820 and “SNR measurement” factor nodes 830, denoted f_(t,n) corresponding to p(z_(t,n) ^(|)x_(t),m).

As illustrated in FIG. 8, the factor graph representing the map posterior contains complex interdependencies between the map cells, neighboring cells, and SNR measurements. An example technique used for efficient inference on such “loopy” factor graphs is the Loopy Belief Propagation (LBP) (e.g., Sum Product). LBP is iterative message passing algorithm that yields estimates of the marginal distributions of the variables after convergence, where convergence may be assumed but is not guaranteed. The present 3-D mapping system and method uses LBP, resulting in an output of the approximate occupancy probabilities for each grid cell, p(m_(i)=1^(|)z).

FIG. 9 show synchronous BP messages passing 800, according to an embodiment. FIG. 9 shows one iteration of synchronous message passing with two classes of messages in a sub-graph containing the two types of vertices. One iteration of BP involves the sequential transmission of all variable-to-factor and factor-to-variable messages. Synchronous message passing (MP) may be used to simplify complexity, and the MP iterations may be initialized with uniform variable-to-factor messages equal to [0.5, 0.5].

Because the factor graph cell variables are binary valued, messages can be viewed as two-dimensional vectors. This allows decomposition of the factor graph shown in FIG. 8 into the two-dimensional vectors shown in FIG. 9. In particular, FIG. 9 shows the two-dimensional vector representing sending all messages from variables 910 to factors 930. The message from cell variable m_(i) may be defined relative to its adjacent measurement factor f_(t,n), which may be computed as follows:

$\begin{matrix} {{{u_{i\rightarrow{({t,n})}}\left( m_{i\;} \right)} = {\frac{\psi_{i}\left( m_{i} \right)}{C_{u}}{\prod\limits_{{({\tau,\eta})} \in {{\mathcal{F}{(i)}}{{\backslash(}{{t,n})}}}}\; {U_{{({\tau,\eta})}\rightarrow i}\left( m_{i} \right)}}}},} & (3) \end{matrix}$

where F(i) indexes the adjacent factors, ψ_(i) (m_(i)) is the cell prior, and C_(u) is a constant ensuring u_(i) _(→) _((t;n))(0)+u_(i) _(→) _((t,n))(1)=1. In the other direction, employing the standard Sum-Product formula yields

$\begin{matrix} {{U_{{({t,n})}\rightarrow i}\left( m_{i} \right)} = {\sum\limits_{\sim {(m_{i})}}{{p\left( {\left. z_{t,n} \middle| m \right.,x_{t}} \right)}\; {u_{j\rightarrow{({t,n})}}\left( m_{j} \right)}}}} & (4) \end{matrix}$

where Σ˜{m_(i)} is the marginalization sum over mi, i.e., a sum over 2^(|M(t,n)|-1) terms where |M(t,n)| in the number of cells observed by the SNR measurement. Because in our application measurement rays typically intersect tens to hundreds of map cells, evaluating (4) directly is unfeasible. However, upon substitution of (2), we obtain the simple formula:

$\begin{matrix} {{U_{{({t,n})}\rightarrow i}\left( m_{i} \right)} = \left\{ {\begin{matrix} \begin{matrix} {{\alpha_{t,n,i} \cdot {j_{LOS}\left( z_{t,n} \right)}} +} \\ {\left( {1 - \alpha_{t,n,i}} \right) \cdot {f_{NLOS}\left( z_{t,n} \right)}} \end{matrix} & {m_{i} = 0} \\ {{f_{NLOS}\left( z_{t,n} \right)},} & {m_{i} = 1} \end{matrix}{where}} \right.} & (5) \\ {\alpha_{t,n,i} = {{{u_{j\rightarrow{({t,n})}}(0)}.}}} & (6) \end{matrix}$

Thus, due to the LOS/NLOS measurement model, computing (4). While computation of (4) generally includes an exponential complexity in the variable clique sizes, |M(t, n)|, this method reduces the computation to linear complexity. After convergence of the messages, the marginal posterior of each cell is approximated by the product of its incoming messages:

$\begin{matrix} {{p\left( {\left. m_{i} \middle| x \right.,z} \right)} \approx {\frac{\psi_{i}\left( m_{i} \right)}{C_{m}}{\prod\limits_{{({t,n})} \in {\mathcal{F}{(i)}}}^{\;}\; {U_{{({t,n})}\rightarrow i}\left( m_{i} \right)}}}} & (7) \end{matrix}$

where C_(m) is a normalizing constant.

As suggested above, the systems and methods described herein advantageously reduce the computational complexity of generating a 3-D map. A substantial portion of the computational complexity of such a mapping method is contained in the iterations of the BP messages passing 800.

FIG. 10 shows an example aerial view 1020 of a building, according to an example embodiment. This building is located at an eastern corner of the campus of the University of California, Santa Barbara (UCSB). Aerial view 1020 is compared to mapping results in FIGS. 12 and 18.

FIG. 11 shows an example mapping results 1100, according to an embodiment. Mapping result comparison 1100 includes an estimated horizontal layer 1110, and includes an aerial view 1120 of the same area. Example mapping result comparison 1100 was generated using GPS measurement data taken outdoors from the eastern corner of the campus of the University of California, Santa Barbara (UCSB). The GPS device used was a Samsung Galaxy Tablet 2.0 running on the Android operating system. The aggregate dataset included nine smaller datasets taken over several days, each containing approximately fifteen minutes of continuous measurement data arriving at 1 Hz. Reported satellite SNR readings ranged in the interval 6-48 dB/Hz, and during each smaller dataset an average of eighteen distinct satellites were in view. While a single pedestrian equipped with GNSS device played the role of the mapping agent in the experiment, the same mapping and parameter selection may apply if up to several robotic agents were to map a similar region across several distinct satellite constellations. Altogether, the nine datasets used in this example comprised of 1.23×10⁵ individual SNR measurement rays and 1.93×10⁵ individual grid cells. Due to the processing efficiencies realized in this method, these example datasets could be processed (including ray tracing, indexing the factor graph, and BP) in 320 seconds using MATLAB on a 64 bit PC with 4 GB of memory and an Intel Core i7-3517U processor clocked at 2.40 GHz.

Estimated horizontal layer 1110 corresponds to occupied space 3-6 meters above ground. As shown in the estimated horizontal layer 1110, white and black areas correspond respectively to areas with estimated occupancy probabilities close to zero and one. Similarly, shades of grey correspond to estimated occupancy probabilities between zero and one. The estimated horizontal layer 1110 also shows building contours obtained from OpenStreetMap. Though the probabilities indicated in the estimated horizontal layer 1110 do not map precisely to building contours, approximate building locations and several large trees can be clearly identified.

As suggested by mapping result comparison 1100, open areas may be easier to map than occupied ones. This may be a result of using passive, non-range sensing. In particular, while every cell intersected by a LOS signal ray is considered empty, a NLOS signal only informs that one or more occupied cell(s) occluded the ray. Hence, if a NLOS ray spans many occupied cells, then each cell will have a tendency to misattribute the blockage to nearby occupied cells. This misattribution can be seen in message and belief equations (9)-(11). If many other intersected cells m_(j), j≠i have estimated occupancy beliefs around 0.5 (or higher), then α_(t,n,i) will be very small and the factor-to-variable message U(t,n)→i(m_(i)) will be proportional to the uninformative value [1,1]. If m_(i) receives many such uninformative messages, then its occupancy probability will be estimated at 0.5 as well. Thus, large buildings can be expected to result in “gray zones” corresponding to occupancy probabilities around 0.5, while empty space is more easily identified with high certainty.

The generation of mapping result comparison 1100 included selection of several parameters. A grid size (cell diameter) of d=3 m was selected, the map height was set to H=27 m, and a minimum satellite elevation of φ_(min)=5° was chosen. For the BP-based inference step, synchronous message passing was employed and 25 iterations were deemed to suffice.

For satellites visible at the GPS receiver, the received power under the LOS hypothesis was modeled using a Rician distribution, given by (3). The estimated total channel power Ω_(t,n) was computed as the maximum of all linear SNR readings 10^(z) ^(τ) ^(,v)/10 belonging to the same dataset η_(t) and from the same satellite with identifier K_(t,n). For simplicity, the Rician K factor was set constant to K=2, indicating moderate fading conditions. For the Log-Normal SNR distribution (4) assumed under NLOS channel conditions, we set μ_(t,n)=10 log 10 Ω_(t,n)−18 and σ=10. That is, the expected signal degradation for a NLOS satellite link was set to 18 dB less than the estimated total power of the “reference” LOS link, and the standard deviation was set to 10 dB, reflecting a large variability in shadowing conditions. Note that, although in reality lower elevation LMS channels are characterized by wider power fluctuations, the widths of both LOS/NLOS distributions were kept constant across satellite elevations. When visibility to a particular satellite was temporarily lost in the middle of an observation window (presumably most often caused by total occlusion), values of fLOS(zt,n)=0.1, fNLOS(zt,n)=0.9 were assigned.

FIG. 12 shows measurement data increase comparison 1200, according to an embodiment. The measurement data increase comparison 1200 includes three horizontal slices 3-6 m above ground level of generated maps as a function of number of datasets used, including a 1-dataset slice 1210, a 3-Dataset slice 1220, and a 9-dataset slice 1230. As with the estimated horizontal layer 1110, this measurement data increase comparison 1200 shows white and black areas corresponding respectively to areas with estimated occupancy probabilities close to zero and one, and shades of grey correspond to estimated occupancy probabilities between zero and one. As suggested by the measurement data increase comparison 1200, additional measurement data seem to improve the map quality over time, as expected.

FIG. 13 shows a horizontal slice height comparison 1300, according to an embodiment. This horizontal slice height comparison 1300 includes six horizontal layers of the 9-dataset map around one building. In particular, horizontal slice height comparison 1300 includes a 0-3 m slice 1310, a 3-6 m slice 1320, a 6-9 m slice 1330, a 9-12 m slice 1340, a 12-15 m slice 1350, and a 15-18 m slice 1360. In this example, the building is approximately ten meters in height, however the 12-15 m slice 1350 and 15-18 m slice 1360 show some nonzero probability of occupancy. This is caused, at least in part, by the use of ground-level GNSS measurements were used, which reduced the probability that LOS satellite signals intersected the middle part of the building roof. Even considering the NLOS artifacts shown above ten meters, horizontal slice height comparison 1300 suggests that the building is no taller than 18 m, and is likely shorter than 12-15 m.

FIG. 14 is a block diagram of a GNSS BP mapping or positioning method 1400, according to an embodiment. In one embodiment, method 1400 may assume a motion model. Method 1400 may include receiving 1410 input GNSS data. Input GNSS data may include receiving multiple predicted satellite coordinates, receiving multiple measured signal-to-noise ratio (SNR) values, or receiving multiple estimated receiver locations. Input GNSS data may also include multiple prior map occupancy probabilities or multiple uncertainty values. Receiving 1410 input GNSS data may also include receiving 1412 an SNR measurement model. The SNR measurement model may describe an expected relationship between multiple SNR measurements and multiple LOS/NLOS likelihoods.

Method 1400 may include constructing 1420 a Bayesian network factor graph, the Bayesian network factor graph including multiple factor graph nodes. Constructing 1420 the Bayesian network factor graph may include sampling 1422 multiple particles for multiple GNSS receiver positions. Constructing 1420 the Bayesian network factor graph may include ray-tracing 1424 multiple rays through multiple voxels within a volumetric map. Each of the rays may represent a GNSS satellite ray from a GNSS receiver position to each of multiple GNSS satellites. Constructing 1420 the Bayesian network factor graph may also include storing multiple occupancy probabilities associated with each of the voxels within the volumetric map, each of the occupancy probabilities indicating a likelihood that each of the voxels is occupied by an obstruction. Constructing 1420 the Bayesian network factor graph may also include assigning (e.g., associating) 1426 a line-of-sight/non-line-of-sight (LOS/NLOS) probability with each of the rays.

Method 1400 may include running 1430 belief propagation to determine mapping estimates for multiple 3-D locations within a 3-D occupancy map. Running 1430 belief propagation may include passing 1432 messages between Bayesian network factor graph nodes. The Bayesian network factor graph nodes may include multiple map state variable nodes and multiple SNR likelihood factor nodes, and running 1430 belief propagation may include passing 1432 messages between the map state variable nodes and the SNR likelihood factor nodes. The Bayesian network factor graph nodes may include multiple position variable nodes, and running 1430 belief propagation may include passing 1432 messages between the position variable nodes and the SNR likelihood factor nodes. Passing 1432 messages may be conducted according to a message passing schedule, where the schedule may be synchronous or asynchronous. Running 1430 belief propagation may include holding position estimates constant. Running 1430 belief propagation may be repeated until convergence on an output within a selected threshold, or may continue for a selected determining duration. The convergence of LBP may be declared when the mean of all variables' belief residuals falls below a predefined threshold Rth. To limit oscillations and help ensure that LBP converges, we may apply message damping with damping factor τϵ[0; 1). The belief residuals of m_(i) and x_(t) may be defined via the L₁ norm:

${R_{i}\overset{\Delta}{=}{\sum\limits_{m_{i} = 0}^{1}\; {{{b_{i}\left( m_{i} \right)} - {b_{i}^{\prime}\left( m_{i} \right)}}}}},{R_{t}\overset{\Delta}{=}{\sum\limits_{k = 1}^{K}\; {{{b_{i}\left( x_{t}^{k} \right)} - {b_{t}^{\prime}\left( x_{t}^{k} \right)}}}}}$

where b_(i)′,b_(t)′ are the beliefs from the previous iteration. While the belief residuals are defined here via the L₁ norm, other belief residuals may be used. Upon converging, or after one or more iterations before converging, running 1430 belief propagation may update 1434 3-D occupancy probabilities.

Method 1400 may include outputting 1450 a navigation output. The navigation output may include a 3-D occupancy map including the 3-D occupancy probabilities, or may include multiple improved position estimates, where the improved position estimates may or may not be in a sequence.

FIG. 15 shows a simultaneous localization and mapping (SLAM) factor graph 1500, according to an embodiment. The system and method of mapping a 3-D environment described above may be extended to provide enhanced localization in the form of position or motion estimates. Referring to FIG. 6, this simultaneous localization and mapping (SLAM) relies on ray tracing from sets of receiver locations (e.g., particles) x₁ 670 and x₂ 675 towards satellites 630 and 635. Probabilistic “beams” of rays, such as parallel rays 610 and 615 emanating from the same particle set x₁ 670 and x₂ 675 and heading to the same satellite 630, may be associated with a probability of being LOS or NLOS, depending on the measured satellite SNR value. These beams may be stitched together to form a soft probabilistic occupancy map using which concurrently re-weights position particles and their departing rays, yielding revised location estimates.

SLAM factor graph 1500 is similar to map posterior distribution factor graph 800, however SLAM factor graph 1500 is extended to depict the relationship to the receiver locations (e.g., particles) x₁ 670 and x₂ 675. In particular, SLAM factor graph 1500 represents the map as a 3D grid of cells, m={m_(i)}^(L), with m_(i)={0, 1} denoting empty and occupied space, and approximates the continuous space of possible GNSS receiver positions x={x_(t)}_(t=1) using sets of particles so that x_(t)={x^(k)}^(K). The SLAM problem is then formulated as estimating the marginal distributions of each latent variable m_(i) and x_(t).

To arrive at these estimates information gathered and reported by GNSS receivers is used. The first type of information is the satellite SNR measurements, which are noisy and consist of T vector SNR readings, Z={z_(t)}^(T)t=1, where z_(t)=[z_(t,1), . . . , z_(t,N) _(t) ], and N_(t) is the number of satellites in view for the i^(th) data sample. Together with individual SNR readings, the receivers also provide satellite identifiers and optionally satellite elevations and azimuths [θ_(t,n), φ_(t,n)], which we consider noiseless. Under the assumption of a static world (when the map m does not change over time), the SNR measurements can be modeled as conditionally independent given the map and poses, yielding the following factorization:

$\begin{matrix} {{p\left( {\left. z \middle| m \right.,x} \right)} = {\prod\limits_{t,n}^{\;}\; {{p\left( {z_{t},\left. n \middle| m \right.,x_{t}} \right)}.}}} & (8) \end{matrix}$

The SNR of a given GNSS signal also depends on many extraneous factors, such as environmental parameters, radio-wave propagation effects, and receiver characteristics. To that end, useful statistical models exist for the narrowband Land to Mobile Satellite (LMS) channels of interest. However, to simplify the computation of messages in our BP-based inference algorithm, we use the following sensor model

$\begin{matrix} {{p\left( {\left. z_{t,n} \middle| m \right.,x_{t}^{k}} \right)} = \left\{ \begin{matrix} {{f_{LOS}\left( {z_{t},n} \right)},} & {m_{i} = {0\mspace{14mu} {\forall{i \in {\left( {t,n,k} \right)}}}}} \\ {{f_{NLOS}\left( {z_{t},n} \right)},} & {otherwise} \end{matrix} \right.} & (9) \end{matrix}$

where M (t, n, k) contains the indices of the cells intersected by the ray starting at particle x^(k), in the direction of satellite n at time t, i.e., its relative coordinates [θ_(t,n), φ_(t,n)]. In other words, an SNR reading is LOS-distributed if all cells intersected by the ray on which it is conditioned are empty; otherwise, it is NLOS-distributed. This is similar to the sensor model described above with respect to FIG. 6, and is intended to implement the same probability densities. As shown in FIG. 5, the SNR under LOS and NLOS hypotheses is modeled using Rician and Log-Normal distributions, though other distributions may be applied, and various distributions may be applied in combination. After a change of variables defining the Rice density on the decibel scale, the LOS density is defined as

$\mspace{20mu} {{{f_{LOS}\left( r_{dB} \right)} = {\frac{\ln \; 10}{20}10^{r_{dB}/20}{f_{Rice}\left( 10^{r_{dB}/20} \right)}}},\mspace{20mu} {where}}$ ${{f_{Rice}(r)} = {\frac{2\left( {K_{R} + 1} \right)r}{\hat{\Omega}}{\exp \left( {{- K_{R}} - \frac{\left( {K_{R} + 1} \right)r^{2}}{\hat{\Omega}}} \right)} \times {I_{0}\left( {2\sqrt{\frac{K_{R}\left( {K_{R} + 1} \right)}{\hat{\Omega}}r}} \right)}}},{r \geq 0}$

is the Rician fading density, I₀(⋅) is the 0th order modified Bessel function of the first kind, and Ω and K_(R) are the total estimated channel power and the Rician “K factor” (ratio of LOS to diffuse power), respectively. As for the NLOS hypothesis, in decibels the Log-Normal fading model simply described by a normal density with mean μ and variance σ².

The second type of information used are the receiver position estimates (GLASS fixes), denoted y={y_(t)}^(T) _(t=1), which are noisy and modeled as independent Gaussian random variables

y _(t) =x _(t) +e _(t) ,e _(t)˜

(0,C _(t)).  (10)

We estimate the error covariance using the coordinates and SNRs of the satellites used to compute the fix so that the position fixes do not depend directly on the state of map. Given the position uncertainties, the particles {x^(k)} are then sampled according to N (y_(t), C_(t)) and assigned equal weights. In general, however, these particles can be sampled according to an importance distribution q_(t)(⋅) and assigned unequal weights proportionate to N(x^(k); y_(t), C_(t))/q_(t)(x^(k)). In some examples, it may be important that the input data is sparsely sampled in time. For example since (3) assumes the pose errors are unbiased and uncorrelated, consecutive GNSS fixes are known to be correlated and biased, so the use of input data that is sparsely sampled in time mitigates the effects of those correlations and biases. As an additional example, in the motion model framework below, the error correlations are mitigated due to enhanced tracking, which may allow the use of more finely sampled GNSS fixes (e.g., those not sparsely sampled in time).

Assuming no a-priori information on the map and poses (such as information on building locations or a motion model governing x), and making use of (1), (3), the posterior distribution of the latent variables given the measurements factorizes as follows:

$\begin{matrix} {{{p\left( {m,\left. x \middle| y \right.,z} \right)} \propto {p\left( {y,\left. z \middle| m \right.,x} \right)}} = {{{p\left( {\left. z \middle| m \right.,x} \right)}{p\left( {\left. y \middle| m \right.,x,z} \right)}} = {\prod\limits_{t,n}^{\;}\; {{p\left( {\left. z_{t,n} \middle| m \right.,x_{t}} \right)} \cdot {\prod\limits_{t}^{\;}\; {{p\left( {\left. y_{t} \middle| z_{t} \right.,x_{t}} \right)}.}}}}}} & (11) \end{matrix}$

However, as described above, per-cell priors ψ_(i)(m_(i)) may also be included in a manner similar to the mapping approach. For example, as explained above with respect to FIG. 4, map prior information may be used to initialize (e.g., seed or hot start) the map.

FIGS. 16A and 16B show synchronous SLAM BP messages passing 1600, according to an embodiment. FIGS. 16A and 16B show one iteration of synchronous message passing in a sub-graph containing the three types of vertices. Because the factor graph cell variables are binary valued, messages can be viewed as two-dimensional vectors. This allows decomposition of the factor graph shown in FIG. 15 into the two-dimensional vectors shown in FIGS. 16A and 16B. In particular, FIG. 16A shows the two-dimensional vector representing the first step of sending all messages from variables 1620 to factors 1610 and 1630, and FIG. 16B shows the two-dimensional vector representing the second step of sending all messages from factors 1615 and 1635 to variables 1625. Note that the factor nodes {g_(t)} play no role in message passing since they are singly connected and because all particles {x^(k)} are assigned equal weights after sampling.

As discussed above, Loopy Belief Propagation is an efficient message passing algorithm used to perform approximate inference on the variables in such graphs, whereby messages are passed locally along edges graph until convergence (which is assumed but not guaranteed in loopy graphs). In the present implementation of BP, we use a synchronous message passing strategy which, in one iteration, involves the sequential transmission of messages from all variable nodes to factor nodes, and vice versa. In particular, each iteration of BP involves the sequential transmission of all variable-to-factor and factor-to-variable messages. Synchronous message passing (MP) may be used to simplify complexity, and the MP iterations may be initialized with uniform variable-to-factor messages equal to [0.5, 0.5].

At the variable nodes, computing the outgoing messages is quite simple. The first step in arriving at them is to compute the variables' beliefs, which are also used to determine convergence. For nodes m_(i) and x_(t), on their respective domains (m_(i) ϵ{0,1} and x_(t) ϵ{x_(t) ¹, . . . , x_(t) ^(K)}), the beliefs are given by

${{b_{i}\left( m_{i} \right)} \propto {{U_{{({t,n})}\rightarrow i}\left( m_{i} \right)}}},{{b_{t}\left( x_{t} \right)} \propto {\prod\limits_{n = 1}^{N_{t}}\; {V_{{({t,n})}\rightarrow t}\left( x_{t} \right)}}},$

where V_((t,v)→t) and U_((t,v)→t) are incoming messages from f_(t,v), F(i)={(t,n):iϵM(t,n)} indexes the {f_(t,n)} neighboring m_(i), and the beliefs are normalized to sum to one. These nodes' outgoing messages to factor node f_(t,n) can then be written as follows:

${{u_{i\rightarrow{({t,n})}}\left( m_{i} \right)} \propto \frac{b_{i}\left( m_{i} \right)}{U_{{({t,n})}\rightarrow i}\left( m_{i} \right)}},{{v_{t\rightarrow{({t,n})}}\left( x_{t} \right)} \propto \frac{b_{t}\left( x_{t} \right)}{V_{{({t,n})}\rightarrow t}\left( x_{t} \right)}},$

which are also normalized to sum to one after computation.

In the other direction, computing the factor-to-variable messages is more complicated. For example, calculation of the messages from f_(t,n) to x_(t), and evaluating at x_(t)=x_(t) ^(k), yields:

${{V_{{({t,n})}\rightarrow t}\left( x_{t}^{k} \right)} = {\sum\limits_{m}{{p\left( {\left. z_{t,n} \middle| m \right.,x_{t}^{k}} \right)}{u_{j\rightarrow{({t,n})}}\left( m_{j} \right)}}}},$

which involves the summation of 2^(|M(t,n)|) terms. Since in our setup beams (t,n) typically intersect hundreds of cells, evaluating this directly is clearly unfeasible. However, upon substitution of the SNR model, and keeping in mind the unit-normalization of the messages {u_(i→(t,n))(m_(i))}, the above expression simplifies as follows:

V_((t, n) → t)(x_(t)^(k)) = γ_(t, n)^(k)f_(LOS)(z_(t, n)) + (1 − γ_(t, n)^(k))F_(NLOS)(z_(t, n)), where: γ_(t, n)^(k) = u_(i → (t, n))(0),

which is of linear complexity in |M(t, n, k)|. Likewise, for the message from SNR measurement f_(t,n) to cell m_(i) we initially have the (even more) complicated expression

${U_{{({t,n})}\rightarrow i}\left( m_{i} \right)} = {\sum\limits_{m\backslash m_{i}}{\sum\limits_{k}{{p\left( {\left. z_{t,n} \middle| m \right.,x_{t}^{k}} \right)} \times {v_{t\rightarrow{({t,n})}}\left( x_{t}^{k} \right)}{u_{j\rightarrow{({t,n})}}\left( m_{j} \right)}}}}$

However, again, by consequence of the binary sensor model, the above expression reduces to

U _((t,n)→i)(m _(i))=α_(t,n,i)+β_(t,n,i)(m _(i))

where

α_(t, n, i) = v_(t → (t, n))(x_(t)^(k)) × {γ_(t, n)^(k)f_(LOS)(z_(t, n)) + (1 − γ_(t, n)^(k))f_(NLOS)(z_(t, n))}, β_(t, n, i)(0) = v_(t → (t, n))(x_(t)^(k)) × {γ_(t, n, i)f_(LOS)(z_(t, n)) + (1 − γ_(t, n, i)^(k))f_(NLOS)(z_(t, n))},   β_(t, n, i)(1) = f_(NLOS)(z_(t, n))v_(t → (t, n))(x_(t)^(k)),

where

γ_(t,n,i) ^(k)=γ_(t,n) ^(k) /u _(i→(t,n))(0),

and K(t,n,i)={k:iϵM(t,n,k)} maintains a list of which particles among {x_(t) ¹, . . . , x_(t) ^(K)} observe cell m^(i) when looking at the nth satellite.

The convergence of LBP may be declared when the mean of all variables' belief residuals falls below a predefined threshold Rth. To limit oscillations and help ensure that LBP converges, we may apply message damping with damping factor ρϵ[0; 1). The belief residuals of m_(i) and x_(t) may be defined via the L₁ norm:

${R_{i}\overset{\Delta}{=}{\sum\limits_{m_{i} = 0}^{1}\; {{{b_{i}\left( m_{i} \right)} - {b_{i}^{\prime}\left( m_{i} \right)}}}}},{R_{t}\overset{\Delta}{=}{\sum\limits_{k = 1}^{K}\; {{{b_{t}\left( x_{t}^{k} \right)} - {b_{t}^{\prime}\left( x_{t}^{k} \right)}}}}}$

where b_(i)′,b_(t)′ are the beliefs from the previous iteration. While the belief residuals are defined here via the L₁ norm, other belief residuals may be used. Upon convergence, or after one or more iterations before convergence, the approximate SLAM solution is simply taken to be the beliefs of all the latent variables, i.e., the marginal posteriors of the map and poses are estimated as p(m_(i)|y,z)≈b_(i)(m_(i)) and p(x_(t)|y,z)≈b_(i)(x_(t)).

FIG. 17 shows an example mapping result comparison 1700, according to an embodiment. Mapping result comparison 1700 includes an estimated horizontal layer 1710, and includes an aerial view 1720 of the same area. Example mapping result comparison 1700 was generated using GPS measurement data taken outdoors from the eastern corner of the campus of the University of California, Santa Barbara (UCSB).

A grid size of 6 m was selected, and the map height was set to 36 m. For the BP-based inference step, 30 iterations of message passing was used. For satellites visible at the GPS receiver, the received power under the LOS hypothesis was modeled using a Rician distribution. The estimated total channel power Ω for each SNR reading was to the maximum of all linear SNR readings 10zt,n/10 from the same satellite during the same time window. For simplicity, the Rician K factor was set constant to KR=2, indicating moderate fading conditions. For the Log-Normal SNR distribution assumed under NLOS channel conditions we set μ (the expected signal power) to 18 dB below the reference power level Ω, and the standard deviation was set to 10 dB, reflecting a large variability in shadowing conditions. When visibility to a particular satellite was temporarily lost in the middle of an observation window (presumably most often caused by total occlusion), the satellite coordinates were interpolated and likelihoods of f_(LOS)(z_(t,n))=0.1, f_(NLOS)(z_(t,n))=0.9 were assigned. A total of 33 data-sets comprised of 3.75×10⁴ SNR measurements that interacted with 6.58×10³ grid cells in the map were used. To mitigate the effects of spatial correlation of geo-location errors, the 3.75×10⁴ measurements represent a factor of 10 downsampling of the original data-set. With 100 particles used to represent the possible geo-location of the receiver at each measurement, the map was generated in approximately 24 minutes on a 64 bit PC with 32 GB of memory and a 3.20 GHz Intel Core i7 processor running MATLAB R2013a.

Estimated horizontal layer 1710 corresponds to occupied space 0-6 meters above ground. As shown in the estimated horizontal layer 1710, white and black areas correspond respectively to areas with estimated occupancy probabilities close to zero and one. Similarly, shades of grey correspond to estimated occupancy probabilities between zero and one. The estimated horizontal layer 1710 also shows building contours obtained from OpenStreetMap. Though the probabilities indicated in the estimated horizontal layer 1710 do not map precisely to building contours, approximate building locations and several large trees can be clearly identified.

FIG. 18 shows a horizontal slice height 1800, according to an embodiment. This horizontal slice height comparison 1800 includes six horizontal layers of the 9-dataset map around the building shown in FIG. 10. In particular, horizontal slice height comparison 1800 includes a 0-3 m slice 1810, a 3-6 m slice 1820, a 6-9 m slice 1830, a 9-12 m slice 1840, a 12-15 m slice 1850, and a 15-18 m slice 1860. FIG. 18 shows several dark spots outside of buildings, such as the dark spot on the south side of the southernmost building. Such dark spots often correspond to trees, as can be seen from the aerial view in FIG. 17.

FIG. 19 shows GPS receiver position fixes and uncertainty ellipses 1900, according to an embodiment. In this example of the localization improvement, a portion of the dataset corresponding to a known path by the receiver was isolated for analysis. The receiver latitude/longitude fixes and corresponding larger uncertainty ellipses are shown, and the improved position estimate and an smaller ellipse corresponding to the sample covariance of the particles are shown. Of particular interest are the points in the north-west corner of the building 1910 where the original fix has errors of several meters in the direction of the building. The proposed algorithm pushes the particles associated with this position fix away from the building and back on the sidewalk near the true path. Without this position correction, the resulting map would have underestimated the occupancy of the cells on the northern wall of the building.

FIG. 20 is a block diagram of a GNSS BP mapping or positioning method 2000, according to an embodiment. In one embodiment, method 2000 may assume a motion model. Method 2000 may include receiving 2010 input GNSS data. Input GNSS data may include receiving multiple predicted satellite coordinates, receiving multiple measured signal-to-noise ratio (SNR) values, or receiving multiple estimated receiver locations. Input GNSS data may also include multiple prior map occupancy probabilities or multiple uncertainty values. Receiving 2010 input GNSS data may also include receiving 2012 an SNR measurement model. The SNR measurement model may describe an expected relationship between multiple SNR measurements and multiple LOS/NLOS likelihoods.

Method 2000 may include constructing 2020 a Bayesian network factor graph, the Bayesian network factor graph including multiple factor graph nodes. Constructing 2020 the Bayesian network factor graph may include sampling 2022 multiple particles for multiple GNSS receiver positions. Constructing 2020 the Bayesian network factor graph may include ray-tracing 2024 multiple rays through multiple voxels within a volumetric map. Each of the rays may represent a GNSS satellite ray from a GNSS receiver position to each of multiple GNSS satellites. Constructing 2020 the Bayesian network factor graph may also include storing multiple occupancy probabilities associated with each of the voxels within the volumetric map, each of the occupancy probabilities indicating a likelihood that each of the voxels is occupied by an obstruction. Constructing 2020 the Bayesian network factor graph may also include assigning (e.g., associating) 2026 a line-of-sight/non-line-of-sight (LOS/NLOS) probability with each of the rays.

Method 2000 may include running 2030 belief propagation to determine mapping estimates for multiple 3-D locations within a 3-D occupancy map. Running 2030 belief propagation may include passing 2032 messages between Bayesian network factor graph nodes. The Bayesian network factor graph nodes may include map state variable nodes, SNR likelihood factor nodes, position variable nodes, and motion variable nodes. Running 2030 belief propagation may include passing 2032 messages between each of these nodes. Passing 2032 messages may be conducted according to a message passing schedule, where the schedule may be synchronous or asynchronous. Running 2030 belief propagation may be repeated until convergence on an output within a selected threshold, or may continue for a selected determining duration. The convergence of LBP may be declared when the mean of all variables' belief residuals falls below a predefined threshold Rth. To limit oscillations and help ensure that LBP converges, we may apply message damping with damping factor ρϵ[0; 1). The belief residuals of m_(i), and x_(t) may be defined via the L₁ norm:

${R_{i}\overset{\Delta}{=}{\sum\limits_{m_{i} = 0}^{1}\; {{{b_{i}\left( m_{i} \right)} - {b_{i}^{\prime}\left( m_{i} \right)}}}}},{R_{t}\overset{\Delta}{=}{\sum\limits_{k = 1}^{K}\; {{{b_{t}\left( x_{t}^{k} \right)} - {b_{t}^{\prime}\left( x_{t}^{k} \right)}}}}}$

where b_(i)′,b_(t)′ are the beliefs from the previous iteration. While the belief residuals are defined here via the L₁ norm, other belief residuals may be used. Upon converging, or before converging after one or more iterations, running 2030 belief propagation may update 2034 3-D occupancy probabilities and receiver position estimates.

Method 2000 may include outputting 2050 a navigation output. The navigation output may include a 3-D occupancy map including the 3-D occupancy probabilities, or may include a sequence of improved position estimates.

FIG. 21 shows a motion factor graph 2100, according to an embodiment. As suggested above, the system and method of mapping a 3-D environment may be extended to provide enhanced localization in the form of estimates of position derivatives (e.g., position, velocity, acceleration). Referring to FIG. 6, this motion factor graph 2100 can be visualized as a motion from receiver location x₁ 670 to receiver location x₂ 675.

The motion model corresponding to the motion factor graph 2100 puts kinematic constraints on the trajectory a GNSS user can follow. In general, its use in SLAM leads to better position estimates and smoother estimated paths, and, in turn, more accurate estimates of the environment map. To include a motion factor graph 2100 in a BP framework, we augment the receiver state variables {x_(t)} with position derivatives, such as velocity and acceleration. Because GPS devices can generally observe user velocity, the GPS fix factors {g_(t)} may vary as a function of the velocity, however the SNR measurement factors do not and only directly depend on the position part of the state. We then introduce additional motion factors {h_(t)} between successive pose variables in time. The factor functions h_(t)(x_(t),x_(t+1)) generally vary across time step t, nominally depending on the sampling interval between successive position nodes or on additional motion type assumptions. For example, a linear Gaussian “constant velocity” model may be used.

The motion model corresponding to the motion factor graph 2100 may be incorporated into a positioning-only algorithm. If one is only interested in performing localization given the current estimate of the map, one may avoid using belief propagation altogether by freezing the map state. That is, by holding the messages from the map cells {m_(i)} constant and not propagating messages back to the map cells, one may perform localization using standard Bayesian filtering techniques on the sequence of variable {x_(t)}. For example, if one is only interested in the most recent position estimate for a given device, one could apply standard sequential Markov Chain Monte Carlo algorithms, such as the particle filtering Markov Chain Monte Carlo algorithm. Instead, if one were interested obtaining more precise estimates of past path segments, one could perform standard particle smoothing algorithms.

FIG. 22 is a block diagram of a GNSS BP mapping or positioning method 2200, according to an embodiment. In one embodiment, method 2200 may assume a motion model, and may include particle map matching. Method 2200 may include receiving 2210 input GNSS data. Input GNSS data may include receiving multiple predicted satellite coordinates, receiving multiple measured signal-to-noise ratio (SNR) values, or receiving multiple estimated receiver locations. Input GNSS data may also include multiple prior map occupancy probabilities or multiple uncertainty values. Receiving 2210 input GNSS data may also include receiving 2212 an SNR measurement model. The SNR measurement model may describe an expected relationship between multiple SNR measurements and multiple LOS/NLOS likelihoods.

Method 2200 may include constructing 2220 a Bayesian network factor graph, the Bayesian network factor graph including multiple factor graph nodes. Constructing 2220 the Bayesian network factor graph may include sampling 2222 multiple particles for multiple GNSS receiver positions. Constructing 2220 the Bayesian network factor graph may include ray-tracing 2224 multiple rays through multiple voxels within a volumetric map. Each of the rays may represent a GNSS satellite ray from a GNSS receiver position to each of multiple GNSS satellites. Constructing 2220 the Bayesian network factor graph may also include storing multiple occupancy probabilities associated with each of the voxels within the volumetric map, each of the occupancy probabilities indicating a likelihood that each of the voxels is occupied by an obstruction. Constructing 2220 the Bayesian network factor graph may also include assigning (e.g., associating) 2226 a line-of-sight/non-line-of-sight (LOS/NLOS) probability with each of the rays.

Method 2200 may include running 2230 belief propagation to determine mapping estimates for multiple 3-D locations within a 3-D occupancy map. Running 2230 belief propagation may include passing 2232 messages between Bayesian network factor graph nodes. The Bayesian network factor graph nodes may include multiple map state variable nodes and multiple SNR likelihood factor nodes, and running 2230 belief propagation may include passing 2232 messages between the map state variable nodes and the SNR likelihood factor nodes. Passing 2232 messages may be conducted according to a message passing schedule, where the schedule may be synchronous or asynchronous. Running 2230 belief propagation may include holding position estimates constant. Running 2230 belief propagation may be repeated until convergence on an output within a selected threshold, or may continue for a selected determining duration. The convergence of LBP may be declared when the mean of all variables' belief residuals falls below a predefined threshold Rth. To limit oscillations and help ensure that LBP converges, we may apply message damping with damping factor ρϵ[0; 1). The belief residuals of m_(i) and x_(t) may be defined via the L₁ norm:

${R_{i}\overset{\Delta}{=}{\sum\limits_{m_{i} = 0}^{1}\; {{{b_{i}\left( m_{i} \right)} - {b_{i}^{\prime}\left( m_{i} \right)}}}}},{R_{t}\overset{\Delta}{=}{\sum\limits_{k = 1}^{K}\; {{{b_{t}\left( x_{t}^{k} \right)} - {b_{t}^{\prime}\left( x_{t}^{k} \right)}}}}}$

where b_(i)′,b_(t)′ are the beliefs from the previous iteration. While the belief residuals are defined here via the L₁ norm, other belief residuals may be used. Upon converging, or before converging but after one or more iterations, running 2230 belief propagation may update 2234 3-D occupancy probabilities and receiver position estimates.

Method 2200 may include applying 2240 Bayesian shadow matching to determine a sequence of improved position estimates. Applying 2240 Bayesian shadow matching may include applying 2242 a particle filter (or particle smoother) while holding map estimates constant. Applying 2240 Bayesian shadow matching may be repeated until convergence on an output within a selected threshold, or may continue for a selected determining duration. Upon converging, running 2030 belief propagation may update 2034 3-D occupancy probabilities. An embodiment of applying 2240 Bayesian shadow matching is shown and described further with respect to FIG. 25.

Method 2200 may include outputting 2250 a navigation output. The navigation output may include a 3-D occupancy map including the 3-D occupancy probabilities, or may include a sequence of improved position estimates.

FIG. 23 is a block diagram of a GNSS particle filter SLAM method 2300, according to an embodiment. In one embodiment, SLAM method 2320 may include receiving 2310 GNSS data. Input GNSS data may include receiving multiple predicted satellite coordinates, receiving multiple measured signal-to-noise ratio (SNR) values, or receiving multiple estimated receiver locations. Input GNSS data may also include multiple prior map occupancy probabilities or multiple uncertainty values. Receiving 2310 input GNSS data may also include receiving 2312 an SNR measurement model. The SNR measurement model may describe an expected relationship between multiple SNR measurements and multiple LOS/NLOS likelihoods.

SLAM method 2320 may include initialization 2320 of a particle set. SLAM method 2320 may include updating 2330 particles. Updating 2330 particles may include updating 2332 receiver state particles. Updating 2330 particles may also include updating 2334 particle weights based on a measurement model and updating 2336 map particles. Updating 2330 particles may be repeated for all particles.

SLAM method 2320 may include resampling 2340 particles. Resampling 2340 particles may include drawing 2342 particles. Drawing 2342 particles may include drawing particles with probability proportionate to particle weights, and may include drawing with replacement. Resampling 2340 particles may include updating 2344 the particle set. Resampling 2340 particles may be repeated for all particles. SLAM method 2320 may include outputting 2350 GNSS particle filter SLAM estimated position and 3-D map.

FIG. 24 is a block diagram of a map update method 2400, according to an embodiment. In one embodiment, map update method 2400 may include updating 2412 prior cell with log-odds occupancy. Map update method 2400 may test if the cell is an intersected cell 2414, and if so, method 2400 may update the current cell with an inverse sensor model. The cell test 2414 may be repeated for all satellites. Map update method 2400 may update 2416 the map with log-odds occupancy probability, which may be repeated for all cells. Map update method 2400 may output an updated 3-D occupancy map.

FIG. 25 is a block diagram of a GNSS map matching method 2500, according to an embodiment. In one embodiment, SLAM method 2520 may include receiving 2510 GNSS data. Input GNSS data may include receiving multiple predicted satellite coordinates, receiving multiple measured signal-to-noise ratio (SNR) values, or receiving multiple estimated receiver locations. Input GNSS data may also include multiple prior map occupancy probabilities or multiple uncertainty values. Receiving 2510 input GNSS data may also include receiving 2512 an SNR measurement model. The SNR measurement model may describe an expected relationship between multiple SNR measurements and multiple LOS/NLOS likelihoods.

SLAM method 2520 may include initialization 2520 of a particle set. SLAM method 2520 may include updating 2530 particles. Updating 2530 particles may include updating 2532 receiver state particles. Updating 2530 particles may also include updating 2534 particle weights based on a measurement model. Updating 2530 particles may be repeated for all particles.

SLAM method 2520 may include resampling 2540 particles. Resampling 2540 particles may include drawing 2542 particles. Drawing 2542 particles may include drawing particles with probability proportionate to particle weights, and may include drawing with replacement. Resampling 2540 particles may include updating 2544 the particle set. Resampling 2540 particles may be repeated for all particles. SLAM method 2520 may include outputting 2550 GNSS particle filter SLAM estimated position and 3-D map.

FIG. 26 is a block diagram of a computing device 2600, according to an embodiment. In one embodiment, multiple such computer systems are used in a distributed network to implement multiple components in a transaction-based environment. An object-oriented, service-oriented, or other architecture may be used to implement such functions and communicate between the multiple systems and components. In some embodiments, the computing device of FIG. 26 is an example of a client device that may invoke methods described herein over a network. In other embodiments, the computing device is an example of a computing device that may be included in or connected to a motion interactive video projection system, as described elsewhere herein. In some embodiments, the computing device of FIG. 26 is an example of one or more of the personal computer, smartphone, tablet, or various servers.

One example computing device in the form of a computer 2610, may include a processing unit 2602, memory 2604, removable storage 2612, and non-removable storage 2614. Although the example computing device is illustrated and described as computer 2610, the computing device may be in different forms in different embodiments. For example, the computing device may instead be a smartphone, a tablet, or other computing device including the same or similar elements as illustrated and described with regard to FIG. 26. Further, although the various data storage elements are illustrated as part of the computer 2610, the storage may include cloud-based storage accessible via a network, such as the Internet.

Returning to the computer 2610, memory 2604 may include volatile memory 2606 and non-volatile memory 2608. Computer 2610 may include or have access to a computing environment that includes a variety of computer-readable media, such as volatile memory 2606 and non-volatile memory 2608, removable storage 2612 and non-removable storage 2614. Computer storage includes random access memory (RAM), read only memory (ROM), erasable programmable read-only memory (EPROM) & electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technologies, compact disc read-only memory (CD ROM), Digital Versatile Disks (DVD) or other optical disk storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium capable of storing computer-readable instructions. Computer 2610 may include or have access to a computing environment that includes input 2616, output 2618, and a communication connection 2620. The input 2616 may include one or more of a touchscreen, touchpad, mouse, keyboard, camera, and other input devices. The computer may operate in a networked environment using a communication connection 2620 to connect to one or more remote computers, such as database servers, web servers, and other computing device. An example remote computer may include a personal computer (PC), server, router, network PC, a peer device or other common network node, or the like. The communication connection 2620 may be a network interface device such as one or both of an Ethernet card and a wireless card or circuit that may be connected to a network. The network may include one or more of a Local Area Network (LAN), a Wide Area Network (WAN), the Internet, and other networks.

Computer-readable instructions stored on a computer-readable medium are executable by the processing unit 2602 of the computer 2610. A hard drive (magnetic disk or solid state), CD-ROM, and RAM are some examples of articles including a non-transitory computer-readable medium. For example, various computer programs 2625 or apps, such as one or more applications and modules implementing one or more of the methods illustrated and described herein or an app or application that executes on a mobile device or is accessible via a web browser, may be stored on a non-transitory computer-readable medium.

ADDITIONAL NOTES & EXAMPLE EMBODIMENTS

Example 1 is a probabilistic GNSS method, the method comprising: receiving input global navigation satellite system (GNSS) data; generating a navigation output based on a probabilistic simultaneous localization and mapping (SLAM); and storing, in a tangible storage medium, the navigation output.

In Example 2, the subject matter of Example 1 optionally includes wherein: generating the navigation output based on the probabilistic SLAM includes determining mapping estimates for a plurality of 3-D locations within a 3-D occupancy map; and storing the navigation output includes storing the plurality of 3-D locations within the 3-D occupancy map.

In Example 3, the subject matter of any one or more of Examples 1-2 optionally include wherein: receiving input GNSS data includes receiving GNSS data corresponding to a plurality of GNSS users; generating the navigation output based on the probabilistic SLAM includes determining a plurality of location estimates, the plurality of location estimates corresponding to the plurality of GNSS users; and storing the navigation output includes storing the plurality of location estimates.

In Example 4, the subject matter of any one or more of Examples 1-3 optionally include wherein receiving the input GNSS data includes: receiving a plurality of predicted satellite coordinates; receiving a plurality of measured signal-to-noise ratio (SNR) values; and receiving a plurality of estimated receiver locations.

In Example 5, the subject matter of any one or more of Examples 1-4 optionally include wherein generating the navigation output based on the probabilistic SLAM includes generating the navigation output based on belief propagation.

In Example 6, the subject matter of Example 5 optionally includes wherein generating the navigation output based on the probabilistic SLAM includes: constructing a Bayesian network factor graph, the Bayesian network factor graph including a plurality of factor graph nodes; and determining mapping estimates for a plurality of 3-D locations within a 3-D occupancy map, the determination of mapping estimates including application of belief propagation to pass messages between Bayesian network factor graph nodes.

In Example 7, the subject matter of any one or more of Examples 5-6 optionally include wherein generating the navigation output is based on a plurality of prior map occupancy probabilities.

In Example 8, the subject matter of any one or more of Examples 5-7 optionally include wherein receiving the input GNSS data further includes receiving a plurality of GNSS receiver position uncertainty values.

In Example 9, the subject matter of any one or more of Examples 5-8 optionally include wherein generating the navigation output is based on an SNR measurement model, the SNR measurement model describing an expected relationship between a plurality of SNR measurements and a plurality of LOS/NLOS likelihoods.

In Example 10, the subject matter of any one or more of Examples 5-9 optionally include wherein constructing the Bayesian network factor graph includes: tracing a plurality of rays through a plurality of voxels within a volumetric map, each of the plurality of rays representing a GNSS satellite ray from a GNSS receiver position to each of a plurality of GNSS satellites; storing a plurality of occupancy probabilities associated with each of the plurality of voxels within the volumetric map, each of the plurality of occupancy probabilities indicating a likelihood that each of the plurality of voxels is occupied by an obstruction; and associating a line-of-sight/non-line-of-sight (LOS/NLOS) probability with each of the plurality of rays.

In Example 11, the subject matter of any one or more of Examples 5-10 optionally include wherein constructing the Bayesian network factor graph further includes sampling a plurality of particles for a plurality of GNSS receiver positions.

In Example 12, the subject matter of any one or more of Examples 5-11 optionally include wherein: the Bayesian network factor graph nodes includes a plurality of map state variable nodes and a plurality of SNR likelihood factor nodes; and the application of belief propagation includes passing messages between the plurality of map state variable nodes and the plurality of SNR likelihood factor nodes.

In Example 13, the subject matter of Example 12 optionally includes wherein passing messages is conducted according to a message passing schedule.

In Example 14, the subject matter of Example 13 optionally includes wherein the message passing schedule is asynchronous.

In Example 15, the subject matter of any one or more of Examples 13-14 optionally include wherein the message passing schedule is synchronous.

In Example 16, the subject matter of any one or more of Examples 5-15 optionally include wherein determining mapping estimates includes holding position estimates constant.

In Example 17, the subject matter of any one or more of Examples 5-16 optionally include wherein: the Bayesian network factor graph nodes further include a plurality of position variable nodes; and the application of belief propagation includes passing messages between the plurality of position variable nodes and the plurality of SNR likelihood factor nodes.

In Example 18, the subject matter of any one or more of Examples 6-17 optionally include wherein: the Bayesian network factor graph nodes further include a plurality of motion variable nodes; and the application of belief propagation includes passing messages between the plurality of motion variable nodes and the plurality of position variable nodes.

In Example 19, the subject matter of any one or more of Examples 6-18 optionally include determining a sequence of improved position estimates, the determination of the sequence of improved position estimates including Bayesian shadow matching.

In Example 20, the subject matter of Example 19 optionally includes wherein Bayesian shadow matching includes applying a particle filter while holding map estimates constant.

In Example 21, the subject matter of any one or more of Examples 19-20 optionally include wherein determining updated position estimates includes passing messages between the plurality of position variable nodes and the plurality of SNR likelihood factor nodes.

In Example 22, the subject matter of any one or more of Examples 19-21 optionally include wherein storing the navigation output includes storing the sequence of improved position estimates.

In Example 23, the subject matter of any one or more of Examples 1-22 optionally include wherein generating the navigation output based on the probabilistic SLAM includes: updating a plurality of receiver state particles; updating a plurality of particle weights, wherein updating the plurality of particle weights is based on a measurement model; updating a plurality of map particles, wherein updating the plurality of map particles includes: updating a plurality of prior cells with a log-odds occupancy probability; updating a current cell with an inverse sensor model when the current cell is associated with an intersected cell; updating a 3-D occupancy map with the log-odds occupancy probability; and outputting the 3-D occupancy map.

In Example 24, the subject matter of Example 23 optionally includes wherein generating the navigation output based on the probabilistic SLAM includes: resampling the plurality of receiver state particles; drawing a plurality of resampled particles; and updating the plurality of map particles.

In Example 25, the subject matter of any one or more of Examples 3-24 optionally include wherein generating the navigation output includes: updating a plurality of receiver state particles; updating a plurality of particle weights, wherein updating the plurality of particle weights is based on a measurement model; updating a plurality of map particles, wherein updating the plurality of map particles includes: updating a plurality of prior cells with a log-odds occupancy probability; updating a current cell with an inverse sensor model when the current cell is associated with an intersected cell; updating a 3-D occupancy map with the log-odds occupancy probability; and outputting the 3-D occupancy map.

In Example 26, the subject matter of Example 25 optionally includes wherein generating the navigation output includes: resampling the plurality of receiver state particles; drawing a plurality of resampled particles; and updating the plurality of map particles.

Example 27 is a non-transitory computer readable medium, with instructions stored thereon, which when executed by the at least one processor cause a computing device to perform data processing activities of any one of the methods of Examples 1-26.

Example 28 is an apparatus comprising means for performing any of the methods of Examples 1-26.

Example 29 is a device comprising: at least one processor; at least one memory; and an instruction set, stored in the at least one memory and executable by the at least one processor to perform data processing activities, the data processing activities comprising: receiving input global navigation satellite system (GNSS) data; generating a navigation output based on probabilistic simultaneous localization and mapping (SLAM); and storing, in the least one memory, the navigation output.

In Example 30, the subject matter of Example 29 optionally includes wherein: generating the navigation output based on the probabilistic SLAM includes determining mapping estimates for a plurality of 3-D locations within a 3-D occupancy map; and storing the navigation output includes storing the plurality of 3-D locations within the 3-D occupancy map.

In Example 31, the subject matter of any one or more of Examples 29-30 optionally include wherein receiving input GNSS data includes receiving GNSS data corresponding to a plurality of GNSS users; generating the navigation output based on the probabilistic SLAM includes determining a plurality of location estimates, the plurality of location estimates corresponding to the plurality of GNSS users; and storing the navigation output includes storing the plurality of location estimates.

In Example 32, the subject matter of any one or more of Examples 29-31 optionally include wherein generating the navigation output based on the probabilistic SLAM includes generating the navigation output based on belief propagation.

In Example 33, the subject matter of any one or more of Examples 29-32 optionally include wherein generating the navigation output based on the probabilistic SLAM includes: constructing a Bayesian network factor graph, the Bayesian network factor graph including a plurality of factor graph nodes; and determining mapping estimates for a plurality of 3-D locations within a 3-D occupancy map, the determination of mapping estimates including application of belief propagation to pass messages between Bayesian network factor graph nodes.

In Example 34, the subject matter of Example 33 optionally includes wherein storing the navigation output includes storing the plurality of 3-D locations within the 3-D occupancy map.

In Example 35, the subject matter of any one or more of Examples 33-34 optionally include wherein receiving the input GNSS data includes: receiving a plurality of predicted satellite coordinates; receiving a plurality of measured signal-to-noise ratio (SNR) values; and receiving a plurality of estimated receiver locations.

In Example 36, the subject matter of Example 35 optionally includes wherein receiving the input GNSS data further includes receiving a plurality of prior map occupancy probabilities.

In Example 37, the subject matter of any one or more of Examples 35-36 optionally include wherein receiving the input GNSS data further includes receiving a plurality of GNSS receiver position uncertainty values.

In Example 38, the subject matter of any one or more of Examples 35-37 optionally include wherein receiving the input GNSS data further includes receiving an SNR measurement model, the SNR measurement model describing an expected relationship between a plurality of SNR measurements and a plurality of LOS/NLOS likelihoods.

In Example 39, the subject matter of any one or more of Examples 33-38 optionally include wherein constructing the Bayesian network factor graph includes: tracing a plurality of rays through a plurality of voxels within a volumetric map, each of the plurality of rays representing a GNSS satellite ray from a GNSS receiver position to each of a plurality of GNSS satellites; storing a plurality of occupancy probabilities associated with each of the plurality of voxels within the volumetric map, each of the plurality of occupancy probabilities indicating a likelihood that each of the plurality of voxels is occupied by an obstruction; and associating a line-of-sight/non-line-of-sight (LOS/NLOS) probability with each of the plurality of rays.

In Example 40, the subject matter of Example 39 optionally includes wherein storing the navigation output includes storing each of the plurality of occupancy probabilities.

In Example 41, the subject matter of any one or more of Examples 33-40 optionally include wherein constructing the Bayesian network factor graph further includes sampling a plurality of particles for a plurality of GNSS receiver positions.

In Example 42, the subject matter of any one or more of Examples 33-41 optionally include wherein: the Bayesian network factor graph nodes includes a plurality of map state variable nodes and a plurality of SNR likelihood factor nodes; and the application of belief propagation includes passing messages between the plurality of map state variable nodes and the plurality of SNR likelihood factor nodes.

In Example 43, the subject matter of Example 42 optionally includes wherein passing messages is conducted according to a message passing schedule.

In Example 44, the subject matter of any one or more of Examples 42-43 optionally include wherein the message passing schedule is asynchronous.

In Example 45, the subject matter of any one or more of Examples 42-44 optionally include wherein the message passing schedule is synchronous.

In Example 46, the subject matter of any one or more of Examples 29-45 optionally include wherein determining mapping estimates includes holding position estimates constant.

In Example 47, the subject matter of any one or more of Examples 33-46 optionally include wherein determining mapping estimates continues until convergence on an output within a selected threshold.

In Example 48, the subject matter of any one or more of Examples 33-47 optionally include wherein determining mapping estimates continues for a selected determining duration.

In Example 49, the subject matter of any one or more of Examples 33-48 optionally include wherein: the Bayesian network factor graph nodes further include a plurality of position variable nodes; and the application of belief propagation includes passing messages between the plurality of position variable nodes and the plurality of SNR likelihood factor nodes.

In Example 50, the subject matter of any one or more of Examples 33-49 optionally include wherein: the Bayesian network factor graph nodes further include a plurality of motion variable nodes; and the application of belief propagation includes passing messages between the plurality of motion variable nodes and the plurality of position variable nodes.

In Example 51, the subject matter of any one or more of Examples 33-50 optionally include determining a sequence of improved position estimates, the determination of the sequence of improved position estimates including Bayesian shadow matching.

In Example 52, the subject matter of Example 51 optionally includes wherein Bayesian shadow matching includes applying a particle filter while holding map estimates constant.

In Example 53, the subject matter of any one or more of Examples 51-52 optionally include wherein determining updated position estimates includes passing messages between the plurality of position variable nodes and the plurality of SNR likelihood factor nodes.

In Example 54, the subject matter of any one or more of Examples 51-53 optionally include wherein storing the navigation output includes storing the sequence of improved position estimates.

Example 55 is a probabilistic GNSS method, the method comprising: receiving input global navigation satellite system (GNSS) data; generating a navigation output based on a Bayesian shadow matching; and storing, in a tangible storage medium, the navigation output.

In Example 56, the subject matter of Example 55 optionally includes wherein generating the navigation output based on the probabilistic SLAM includes generating the navigation output based on belief propagation.

In Example 57, the subject matter of Example 56 optionally includes wherein generating the navigation output based on the probabilistic SLAM includes: constructing a Bayesian network factor graph, the Bayesian network factor graph including a plurality of factor graph nodes; and determining mapping estimates for a plurality of 3-D locations within a 3-D occupancy map, the determination of mapping estimates including application of belief propagation to pass messages between Bayesian network factor graph nodes.

In Example 58, the subject matter of any one or more of Examples 56-57 optionally include wherein constructing the Bayesian network factor graph includes: tracing a plurality of rays through a plurality of voxels within a volumetric map, each of the plurality of rays representing a GNSS satellite ray from a GNSS receiver position to each of a plurality of GNSS satellites; storing a plurality of occupancy probabilities associated with each of the plurality of voxels within the volumetric map, each of the plurality of occupancy probabilities indicating a likelihood that each of the plurality of voxels is occupied by an obstruction; and associating a line-of-sight/non-line-of-sight (LOS/NLOS) probability with each of the plurality of rays.

In Example 59, the subject matter of any one or more of Examples 56-58 optionally include wherein constructing the Bayesian network factor graph further includes sampling a plurality of particles for a plurality of GNSS receiver positions.

In Example 60, the subject matter of any one or more of Examples 56-59 optionally include wherein: the Bayesian network factor graph nodes includes a plurality of map state variable nodes and a plurality of SNR likelihood factor nodes; and the application of belief propagation includes passing messages between the plurality of map state variable nodes and the plurality of SNR likelihood factor nodes.

In Example 61, the subject matter of any one or more of Examples 56-60 optionally include wherein: the Bayesian network factor graph nodes further include a plurality of position variable nodes; and the application of belief propagation includes passing messages between the plurality of position variable nodes and the plurality of SNR likelihood factor nodes.

In Example 62, the subject matter of any one or more of Examples 57-61 optionally include wherein: the Bayesian network factor graph nodes further include a plurality of motion variable nodes; and the application of belief propagation includes passing messages between the plurality of motion variable nodes and the plurality of position variable nodes.

In Example 63, the subject matter of any one or more of Examples 57-62 optionally include wherein Bayesian shadow matching includes determining a sequence of improved position estimates.

In Example 64, the subject matter of Example 63 optionally includes wherein Bayesian shadow matching includes applying a particle filter while holding map estimates constant.

Example 65 is a non-transitory computer readable medium, with instructions stored thereon, which when executed by the at least one processor cause a computing device to perform data processing activities of any one of the methods of Examples 55-64.

Example 66 is an apparatus comprising means for performing any of the methods of Examples 55-64.

Each of these non-limiting examples can stand on its own, or can be combined in various permutations or combinations with one or more of the other examples.

Conventional terms in the fields of GNSS analysis have been used herein. The terms are known in the art and are provided only as a non-limiting example for convenience purposes. Accordingly, the interpretation of the corresponding terms in the claims, unless stated otherwise, is not limited to any particular definition. Thus, the terms used in the claims should be given their broadest reasonable interpretation.

Although specific embodiments have been illustrated and described herein, it will be appreciated by those of ordinary skill in the art that any arrangement that is calculated to achieve the same purpose may be substituted for the specific embodiments shown. Many adaptations will be apparent to those of ordinary skill in the art. Accordingly, this application is intended to cover any adaptations or variations.

The above detailed description includes references to the accompanying drawings, which form a part of the detailed description. The drawings show, by way of illustration, specific embodiments that may be practiced. These embodiments are also referred to herein as “examples.” Such examples may include elements in addition to those shown or described. However, the present inventors also contemplate examples in which only those elements shown or described are provided. Moreover, the present inventors also contemplate examples using any combination or permutation of those elements shown or described (or one or more aspects thereof), either with respect to a particular example (or one or more aspects thereof), or with respect to other examples (or one or more aspects thereof) shown or described herein.

All publications, patents, and patent documents referred to in this document are incorporated by reference herein in their entirety, as though individually incorporated by reference. In the event of inconsistent usages between this document and those documents so incorporated by reference, the usage in the incorporated reference(s) should be considered supplementary to that of this document; for irreconcilable inconsistencies, the usage in this document controls.

In this document, the terms “a” or “an” are used, as is common in patent documents, to include one or more than one, independent of any other instances or usages of “at least one” or “one or more.” In this document, the term “or” is used to refer to a nonexclusive or, such that “A or B” includes “A but not B,” “B but not A,” and “A and B,” unless otherwise indicated. In this document, the terms “including” and “in which” are used as the plain-English equivalents of the respective terms “comprising” and “wherein.” Also, in the following claims, the terms “including” and “comprising” are open-ended, that is, a system, device, article, or process that includes elements in addition to those listed after such a term in a claim are still deemed to fall within the scope of that claim. Moreover, in the following claims, the terms “first,” “second,” and “third,” etc. are used merely as labels, and are not intended to impose numerical requirements on their objects.

Method examples described herein can be machine or computer-implemented at least in part. Some examples can include a computer-readable medium or machine-readable medium encoded with instructions operable to configure an electronic device to perform methods as described in the above examples. An implementation of such methods can include code, such as microcode, assembly language code, a higher-level language code, or the like. Such code can include computer-readable instructions for performing various methods. The code may form portions of computer program products. Further, in an example, the code can be tangibly stored on one or more volatile, non-transitory, or non-volatile tangible computer-readable media, such as during execution or at other times. Examples of these tangible computer-readable media can include, but are not limited to, hard disks, removable magnetic disks, removable optical disks (e.g., compact disks and digital video disks), magnetic cassettes, memory cards or sticks, random access memories (RAMs), read-only memories (ROMs), and the like.

The above description is intended to be illustrative, and not restrictive. For example, the above-described examples (or one or more aspects thereof) may be used in combination with each other. Other embodiments may be used, such as by one of ordinary skill in the art upon reviewing the above description. The Abstract is provided to comply with 37 C.F.R. § 1.72(b), to allow the reader to quickly ascertain the nature of the technical disclosure and is submitted with the understanding that it will not be used to interpret or limit the scope or meaning of the claims. In addition, in the above Detailed Description, various features may be grouped together to streamline the disclosure. This should not be interpreted as intending that an unclaimed disclosed feature is essential to any claim. Rather, inventive subject matter may lie in less than all features of a particular disclosed embodiment. Thus, the following claims are hereby incorporated into the Detailed Description, with each claim standing on its own as a separate embodiment, and it is contemplated that such embodiments can be combined with each other in various combinations or permutations. The scope of the embodiments should be determined with reference to the appended claims, along with the full scope of equivalents to which such claims are entitled. 

What is claimed is:
 1. A probabilistic global navigation satellite system (GNSS) method, the method comprising: receiving an input GNSS data from one or more GNSS data devices; constructing a Bayesian network factor graph including a plurality of Bayesian network factor graph nodes, wherein constructing the Bayesian network factor graph includes sampling multiple particles representing possible GNSS data device positions and ray-tracing multiple rays through multiple voxels within a volumetric map, each of the plurality of rays representing a GNSS satellite ray from a GNSS receiver position to each of a plurality of GNSS satellites; and determining an improved position estimate for each of the one or more GNSS data devices by applying Bayesian shadow matching, which includes applying a particle filter to generate an improved position estimate for each of the one or more GNSS data devices.
 2. The method of claim 1, wherein the GNSS data includes an estimated position of each of the GNSS data devices and a plurality of signal-to-noise ratio (SNR) values measure by each of the one or more GNSS data devices.
 3. The method of claim 2, wherein receiving the input GNSS data includes receiving an SNR measurement model that describes an expected relationship between multiple SNR measurements and multiple LOS/NLOS likelihoods.
 4. The method of claim 1, wherein constructing the Bayesian network further includes assigning a plurality of occupancy probabilities associated with each of the plurality of voxels within the volumetric map, each of the plurality of occupancy probabilities indicating a likelihood that each of the plurality of voxels is occupied by an obstruction.
 5. The method of claim 4, wherein constructing the Bayesian network further includes associating a line-of-sight/non-line-of-sight (LOS/NLOS) probability with each of the plurality of rays.
 6. The method of claim 4, wherein the occupancy probabilities associated with each of the plurality of voxels within the volumetric map are held constant while determining the improve position estimate.
 7. The method of claim 4, further including determining mapping estimates for the plurality of voxels within the volumetric map, the determining mapping estimates including an application of belief propagation to pass messages between Bayesian network factor graph nodes to update the plurality of occupancy probabilities associated with each of the plurality of voxels.
 8. The method of claim 1, wherein constructing a Bayesian network factor graph further includes incorporating a motion model that incorporates kinetic constraints on position estimates.
 9. A device comprising: at least one processor; at least one memory; and an instruction set, stored in the at least one memory and executable by the at least one processor to perform data processing activities, the data processing activities comprising: receiving an input GNSS data from one or more GNSS data devices; constructing a Bayesian network factor graph including a plurality of Bayesian network factor graph nodes, wherein constructing the Bayesian network factor graph includes sampling multiple particles representing possible GNSS data device positions and ray-tracing multiple rays through multiple voxels within a volumetric map, each of the plurality of rays representing a GNSS satellite ray from a GNSS receiver position to each of a plurality of GNSS satellites; and determining an improved position estimate for each of the one or more GNSS data devices by applying Bayesian shadow matching, which includes applying a particle filter to generate an improved position estimate for each of the one or more GNSS data devices; and storing, in the at least one memory, the improved position estimate.
 10. The device of claim 9, wherein the GNSS data includes an estimated position of each of the GNSS data devices and a plurality of signal-to-noise ratio (SNR) values measure by each of the one or more GNSS data devices.
 11. The device of claim 10, wherein receiving the input GNSS data includes receiving an SNR measurement model that describes an expected relationship between multiple SNR measurements and multiple LOS/NLOS likelihoods.
 12. The device of claim 9, wherein constructing the Bayesian network further includes assigning a plurality of occupancy probabilities associated with each of the plurality of voxels within the volumetric map, each of the plurality of occupancy probabilities indicating a likelihood that each of the plurality of voxels is occupied by an obstruction.
 13. The device of claim 11, wherein constructing the Bayesian network further includes associating a line-of-sight/non-line-of-sight (LOS/NLOS) probability with each of the plurality of rays.
 14. The device of claim 11, wherein the occupancy probabilities associated with each of the plurality of voxels within the volumetric map are held constant while determining the improve position estimate.
 15. The device of claim 11, further including determining mapping estimates for the plurality of voxels within the volumetric map, the determining mapping estimates including an application of belief propagation to pass messages between Bayesian network factor graph nodes to update the plurality of occupancy probabilities associated with each of the plurality of voxels.
 16. The device of claim 9, wherein constructing a Bayesian network factor graph further includes incorporating a motion model that incorporates kinetic constraints on position estimates. 